Optimal Path Finding in Direction, Location and Time Dependent Environments
نویسنده
چکیده
This paper examines optimal path finding problems where cost function and constraints are direction, location and time dependent. Recent advancements in sensor and data-processing technology facilitate the collection of detailed real-time information about the environment surrounding a ground vehicle, an airplane or a naval vessel. We present a navigation model that makes use of such information. We relax a number of assumptions from existing literature on path-finding problems and create an accurate, yet tractable, model suitable for implementation for a large class of problems. We present a dynamic programming model which integrates our earlier results for direction-dependent, time and space homogeneous environment and, consequently, improves its accuracy, efficiency and run-time. The proposed path finding model also addresses limited information about the surrounding environment, control-feasibility of the considered paths, such as sharpest feasible turns a vehicle can make, and computational demands of a time-dependent environment. To demonstrate the applicability and performance of our path-finding algorithm, computational experiments for a short-range ship routing in dynamic wave-field problem are presented.
منابع مشابه
Dynamic Navigation in Direction-Dependent Environments
This chapter examines optimal path finding problems with direction, location and time dependent environments. The dependence of the cost function and path constraints on the location of the mobile agent and time creates the need for a dynamic navigation algorithm, capable of adjusting the path in real-time as more information about the environment becomes available. In addition, the direction-d...
متن کاملNear-Minimum-Time Motion Planning of Manipulators along Specified Path
The large amount of computation necessary for obtaining time optimal solution for moving a manipulator on specified path has made it impossible to introduce an on line time optimal control algorithm. Most of this computational burden is due to calculation of switching points. In this paper a learning algorithm is proposed for finding the switching points. The method, which can be used for both ...
متن کاملAn Efficient Motion Strategy to Compute Expected-Time Locally Optimal Continuous Search Paths in Known Environments
In this paper we address the problem of finding time-optimal search paths in known environments. In particular, we address the problem of searching a known environment for an object whose unknown location is characterized by a known probability density function (PDF). With this formulation, the time required to find the object is a random variable induced by the choice of search path together w...
متن کاملFinding the Optimal Path to Restoration Loads of Power Distribution Network by Hybrid GA-BCO Algorithms Under Fault and Fuzzy Objective Functions with Load Variations
In this paper proposes a fuzzy multi-objective hybrid Genetic and Bee colony optimization algorithm(GA-BCO) to find the optimal restoration of loads of power distribution network under fault.Restoration of distribution systems is a complex combinatorial optimization problem that should beefficiently restored in reasonable time. To improve the efficiency of restoration and facilitate theactivity...
متن کاملTime-optimal trajectories with bounded curvature in anisotropic media
This paper characterizes time-optimal trajectories in anisotropic (direction-dependent) environments where path curvatures are bounded by the minimum turning radius of a mobile agent. Such problems are often faced in the navigation of aerial, ground and naval vehicles when a mobile agent cannot instantaneously change its heading angle. The presented work is a generalization of the Dubins car pr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009